Simple and subdirectly irreducibles bounded distributive lattices with unary operators

نویسنده

  • Sergio A. Celani
چکیده

Distributive lattices with operators (DLO) are a natural generalization of the notion of Boolean algebras with operators. An operator in a bounded distributive lattice A is a function f : An → A which preserves ∧ (or ∨) in each coordinate. In the last few years these classes of algebras have been actively investigated since they appear as algebraic counterpart of many logics. Some important contributions in this area have been the papers of Goldblatt [12], Petrovich [16], and Sofronie-Stokkermans [18] which deal with the representation and topological duality for DLO. More recently, in [11] Gehrke et al. have studied conditions for canonicity and an automatic mechanism for the translation of equations that are Sahlqvist. In [17] Sofronie-Stokkermans studies a uniform presentation of representation and decibility results related to a Kripke-style semantics, and the link between algebraic and Kripke-style semantics of several nonclassical logics. Positive modal logic was introduced by Dunn in [10], and it corresponds to the positive fragment of the local modal consequence relation defined by the class of all Kripke frames. The algebraic semantic of this fragment is the variety of positive modal algebras (or PM-algebras) introduced in [10], and further studied by means of topological methods in [7], and in [6] by methods from abstract algebraic logic. A PM-algebra is a bounded distributive lattice with two unary modal operators and ♦ satisfying additional conditions that relate to these operators. Topological Boolean algebras or closure Boolean algebras were given byMcKinsey and Tarski [15] to conduct an algebraic study of topological spaces (see also [4]). In [13],

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Topological Duality and Lattice Expansions Part II: Lattice Expansions with Quasioperators

Lattices have many applications in mathematics and logic, in which they occur together with additional operations. For example, in applications of Hilbert spaces, one is often concerned with the lattice of closed subspaces of a fixed space. This lattice is not distributive, but there is an operation taking a given subspace to its orthogonal subspace. More generally, ortholattices are lattices w...

متن کامل

Priestley Duality for Many Sorted Algebras and Applications

In this work we develop a categorical duality for certain classes of manysorted algebras, called many-sorted lattices because each sort admits a structure of distributive lattice. This duality is strongly based on the Priestley duality for distributive lattices developed in [3] and [4] and on the representation of many sorted lattices with operators given by Sofronie-Stokkermans in [6]. In this...

متن کامل

Distributive Lattices with Quantifiers: Topological Representation

We give a representation of distributive lattices with the existential quantifier in terms of spectral spaces, which is an alternative to Cignoli’s representation in terms of Priestley spaces. Then we describe dual spectral spaces of subdirectly irreducible and simple Q-distributive lattices and prove that the variety QDist of Q-distributive lattices does not have the congruence extension prope...

متن کامل

Distributive lattices with strong endomorphism kernel property as direct sums

Unbounded distributive lattices which have strong endomorphism kernel property (SEKP) introduced by Blyth and Silva in [3] were fully characterized in [11] using Priestley duality (see Theorem  2.8}). We shall determine the structure of special elements (which are introduced after  Theorem 2.8 under the name strong elements) and show that these lattices can be considered as a direct product of ...

متن کامل

A Duality Theory for

Recent studies of the algebraic properties of bilattices have provided insight into their internal structures, and have led to practical results, especially in reducing the computational complexity of bilattice-based multi-valued logic programs. In this paper the representation theorem for interlaced bilattices with negation found in 18] and extended to arbitrary interlaced bilattices without n...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Int. J. Math. Mathematical Sciences

دوره 2006  شماره 

صفحات  -

تاریخ انتشار 2006